Fast linear iterations for distributed averaging
نویسندگان
چکیده
منابع مشابه
Fast linear iterations for distributed averaging
We consider the problem of !nding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of !nding the fastest converging linear iteration can be cast as a semide!nite program, and therefore e"ciently and globally solved. These op...
متن کاملFaster Linear Iterations for Distributed Averaging
Abstract: Distributed averaging problems are a subclass of distributed consensus problems, which have received substantial attention from several research communities. Although many of the proposed algorithms are linear iterations, they vary both in structure and state dimension. In this paper, we investigate the performance benefits of adding extra states to distributed averaging iterations. W...
متن کاملAveraging Asynchronously Using Double Linear Iterations∗
The distributed averaging problem is to devise a protocol which will enable the members of a group of n > 1 agents to asymptotically determine in a decentralized manner, the average of the initial values of their scalar agreement variables. A typical averaging protocol can be modeled by a linear iterative equation whose update matrices are doubly stochastic. Building on the ideas proposed in [1...
متن کاملOptimal Finite-Time Distributed Linear Averaging
A new optimal finite-time distributed linear averaging (OFTDLA) problem is presented in this paper. This problem is motivated from the distributed averaging problem which arises in the context of distributed algorithms in computer science and coordination of groups of autonomous agents in engineering. The aim of the OFTDLA problem is to compute the average of the initial values in finite-time s...
متن کاملApproximated power iterations for fast subspace tracking
This paper introduces a fast implementation of the power iterations method for subspace tracking, based on an approximation less restrictive than the well known projection approximation. This algorithm guarantees the orthonormality of the estimated subspace weighting matrix at each iteration, and satisfies a global and exponential convergence property. Moreover, it outperforms many subspace tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2004
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2004.02.022